The complexity of deciding stability under FFS in the Adversarial Queueing model
نویسندگان
چکیده
We address the problem of deciding whether a given network is stable in the Adversarial Queueing Model when considering farthest-from-source (FFS) as the queueing policy to schedule the packets through its links. We show a characterisation of the networks which are stable under FFS in terms of a family of forbidden subgraphs. We show that the set of networks stable under FFS coincide with the set of universally stable networks. Since universal stability of networks can be checked in polynomial time, we obtain that stability under FFS can also be decided in polynomial time. 2004 Elsevier B.V. All rights reserved. MSC: 68Q25; 68R10; 90B12; 90B15; 90B22
منابع مشابه
Adversarial Models for Priority-Based Networks
We propose several variations of the adversarial queueing model to cope with packets that can have different priorities, the priority and variable priority models, and link failures, the failure and reliable models. We address stability issues in the proposed adversarial models. We show that the set of universally stable networks in the adversarial model remains the same in the four introduced ...
متن کاملDeciding Stability in Packet-Switched FIFO Networks Under the Adversarial Queuing Model in Polynomial Time ,
In spite of the importance of the fifo protocol and the research efforts invested in obtaining results for it, deciding whether a given (packet-switched) network is stable under fifo has remained an open question for several years. In this work, we address the general case of this problem and try to characterize the property of stability under fifo in terms of network topologies. Such a charact...
متن کاملDeciding the FIFO Stability of Networks in Polynomial Time
FIFO is the most prominent queueing strategy due to its simplicity and the fact that it only works with local information. Its analysis within the adversarial queueing theory however has shown, that there are networks that are not stable under the FIFO protocol, even at arbitrarily low rate. On the other hand there are networks that are universally stable, i.e., they are stable under every gree...
متن کاملUsing fluid models to prove stability of adversarial queueing networks
A digital communication network can be modeled as an adversarial queueing network. An adversarial queueing network is defined to be stable if the number of packets stays bounded over time. A central question is to determine which adversarial queueing networks are stable under every work-conserving packet routing policy. Our main result is that stability of an adversarial queueing network is imp...
متن کاملGamarnik : Using Fluid Models to Prove Stability of Adversarial Queueing Networks
| A digital communication network can be modeled as an adversarial queueing network. An adversarial queueing network is deened to be stable if the number of packets stays bounded over time. A central question is to determine which adversarial queueing networks are stable under every work-conserving packet routing policy. Our main result is that stability of an adversarial queueing network is im...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
- Inf. Process. Lett.
دوره 90 شماره
صفحات -
تاریخ انتشار 2004